Properties, Proved and Conjectured, of Keller, Mycielski, and Queen Graphs
نویسندگان
چکیده
We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In the unproved case, we have a conjecture supported by a vast amount of computation, which involved the development of a new edge-coloring algorithm. The conjecture is that the edge-chromatic number is the maximum degree, except when simple arithmetic forces the edge-chromatic number to be one greater than the maximum degree. For Mycielski graphs, we strengthen an old result that the graphs are Hamiltonian by showing that they are Hamilton-connected (exceptM3, which is a cycle). For Keller graphsGd, we establish, in all cases, the exact value of the chromatic number, the edge-chromatic number, and the independence number; and we get the clique covering number in all cases except 5 ≤ d ≤ 7. We also investigate Hamiltonian decompositions of Keller graphs, obtaining them up to G6.
منابع مشابه
The Circular Chromatic Number of the Mycielski's Graph M
As a natural generalization of chromatic number of a graph, the circular chromatic number of graphs (or the star chromatic number) was introduced by A.Vince in 1988. Let M (G) denote the tth iterated Mycielski graph of G. It was conjectured by Chang, Huang and Zhu(Discrete mathematics,205(1999), 23-37) that for all n ≥ t+2, χc(M (Kn)) = χ(M (Kn)) = n+ t. In 2004, D.D.F. Liu proved the conjectur...
متن کاملTotal domination in $K_r$-covered graphs
The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...
متن کاملCircular Chromatic Number and Mycielski Graphs
As a natural generalization of graph coloring, Vince introduced the star chromatic number of a graph G and denoted it by χ∗(G). Later, Zhu called it circular chromatic number and denoted it by χc(G). Let χ(G) be the chromatic number of G. In this paper, it is shown that if the complement of G is non-hamiltonian, then χc(G)=χ(G). Denote by M(G) the Mycielski graph of G. Recursively define Mm(G)=...
متن کاملComputing Certain Topological Indices of Generalised Mycielskian Graphs
The generalized Mycielskians are the generalization of the Mycielski graphs, which were introduced by Mycielski in 1955. A topological index is a numeric parameter mathematically derived from a graph and is invariant under automorphism of graphs. Topological indices are widely used for establishing correlations between the structure of a molecular compound and its different physico-chemical pro...
متن کاملA lower bound on the chromatic number of Mycielski graphs
In this work we give a new lower bound on the chromatic number of a Mycielski graph Mi. The result exploits a mapping between the coloring problem and a multiprocessor task scheduling problem. The tightness of the bound is proved for i = 1; : : : ; 8. c © 2001 Elsevier Science B.V. All rights reserved.
متن کامل